A note on Bar Induction in Constructive Set Theory
نویسنده
چکیده
Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloFraenkel Set Theory, CZF. It is shown that CZF augmented by decidable Bar Induction proves the 1-consistency of CZF. This answers a question of P. Aczel who used Bar Induction to give a proof of the Lusin Separation Theorem in the constructive set theory CZF.
منابع مشابه
Constructive Set Theory and Brouwerian Principles
The paper furnishes realizability models of constructive Zermelo-Fraenkel set theory, CZF, which also validate Brouwerian principles such as the axiom of continuous choice (CC), the fan theorem (FT), and bar induction (BI), and thereby determines the proof-theoretic strength of CZF augmented by these principles. The upshot is that CZF+CC+FT possesses the same strength as CZF, or more precisely,...
متن کاملInvited Talks and Tutorials A Constructive Version of the Lusin Separation Theorem
The Lusin Separation Theorem is one of the fundamental early results of classical descriptive set theory. It states that if A1, A2 are disjoint analytic subsets of Baire space then they are Borel separable. Yiannis Moschovakis gives two proofs in his book, “Descriptive Set Theory”. One proof is obviously highly non-constructive. The other would appear to be constructive and uses Bar Induction a...
متن کاملDerived rules for predicative set theory: An application of sheaves
We show how one may establish proof-theoretic results for constructive Zermelo-Fraenkel set theory, such as the compactness rule for Cantor space and the Bar Induction rule for Baire space, by constructing sheaf models and using their preservation properties.
متن کاملThe strength of some Martin-Löf type theories
One objective of this paper is the determination of the proof–theoretic strength of Martin– Löf’s type theory with a universe and the type of well–founded trees. It is shown that this type system comprehends the consistency of a rather strong classical subsystem of second order arithmetic, namely the one with ∆2 comprehension and bar induction. As Martin-Löf intended to formulate a system of co...
متن کاملConsistency of the minimalist foundation with Church thesis and Bar Induction
We consider a version of the minimalist foundation previously introduced to formalize predicative constructive mathematics. This foundation is equipped with two levels to meet the usual informal practice of developing mathematics in an extensional set theory (its extensional level) with the possibility of formalizing it in an intensional theory enjoying a proofs as programs semantics (its inten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Log. Q.
دوره 52 شماره
صفحات -
تاریخ انتشار 2006